Approach to positional logic algebra

The method of Boolean function representation in terms positional logic algebra compact operator form is offered. Compared with the known method, it uses position operators a complexity no more than two and only one type equivalent transformations. less labor intensive. It allows parallelizing calculations. corresponding way implementation developed. competes some ways hardware complexity, resource intensity, speed when implemented on an FPGA basis. Possibilities open up for creating effective automating means representing functions from large number variables, synthesizing LCs, improving modern element bases.